The Disjunctive Conception of Perceiving

John McDowell's conception of perceptual knowledge commits him to the claim that if I perceive that P then I am in a position to know that I perceive that P. In the first part of this essay, I present some reasons to be suspicious of this claim - reasons which derive from a general argument against 'luminosity' - and suggest that McDowell can reject this claim, while holding on to almost all of the rest of his conception of perceptual knowledge, by supplementing his existing disjunctive conception of experience with a new disjunctive conception of perceiving. In the second part of the essay, I present some reasons for thinking that one's justification, in cases of perceptual knowledge, consists not in the fact that one perceives that P but in the fact that one perceives such-and-such. I end by suggesting that the disjunctive conception of perceiving should be understood as a disjunctive conception of perceiving such-and-such

Near-optimum universal graphs for graphs with bounded degrees (Extended abstract)

Let H be a family of graphs. We say that G is H-universal if, for each H ∈H, the graph G contains a subgraph isomorphic to H. Let H(k, n) denote the family of graphs on n vertices with maximum degree at most k. For each fixed k and each n sufficiently large, we explicitly construct an H(k, n)-universal graph Γ(k, n) with O(n2−2/k(log n)1+8/k) edges. This is optimal up to a small polylogarithmic factor, as Ω(n2−2/k) is a lower bound for the number of edges in any such graph. En route, we use the probabilistic method in a rather unusual way. After presenting a deterministic construction of the graph Γ(k, n), we prove, using a probabilistic argument, that Γ(k, n) is H(k, n)-universal. So we use the probabilistic method to prove that an explicit construction satisfies certain properties, rather than showing the existence of a construction that satisfies these properties. © Springer-Verlag Berlin Heidelberg 200

Quasirandom permutations are characterized by 4-point densities

For permutations π and τ of lengths |π|≤|τ| , let t(π,τ) be the probability that the restriction of τ to a random |π| -point set is (order) isomorphic to π . We show that every sequence {τj} of permutations such that |τj|→∞ and t(π,τj)→1/4! for every 4-point permutation π is quasirandom (that is, t(π,τj)→1/|π|! for every π ). This answers a question posed by Graham

How Reasoning Aims at Truth

Many hold that theoretical reasoning aims at truth. In this paper, I ask what it is for reasoning to be thus aim-directed. Standard answers to this question explain reasoning’s aim-directedness in terms of intentions, dispositions, or rule-following. I argue that, while these views contain important insights, they are not satisfactory. As an alternative, I introduce and defend a novel account: reasoning aims at truth in virtue of being the exercise of a distinctive kind of cognitive power, one that, unlike ordinary dispositions, is capable of fully explaining its own exercises. I argue that this account is able to avoid the difficulties plaguing standard accounts of the relevant sort of mental teleology

Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs

General upper tail estimates are given for counting edges in a random induced subhypergraph of a fixed hypergraph H, with an easy proof by estimating the moments. As an application we consider the numbers of arithmetic progressions and Schur triples in random subsets of integers. In the second part of the paper we return to the subgraph counts in random graphs and provide upper tail estimates in the rooted case.Comment: 15 page

Efficient O(N2)\mathcal{O}(N^2) approach to solve the Bethe-Salpeter equation for excitonic bound states

Excitonic effects in optical spectra and electron-hole pair excitations are described by solutions of the Bethe-Salpeter equation (BSE) that accounts for the Coulomb interaction of excited electron-hole pairs. Although for the computation of excitonic optical spectra in an extended frequency range efficient methods are available, the determination and analysis of individual exciton states still requires the diagonalization of the electron-hole Hamiltonian $\hat{H}$. We present a numerically efficient approach for the calculation of exciton states with quadratically scaling complexity, which significantly diminishes the computational costs compared to the commonly used cubically scaling direct-diagonalization schemes. The accuracy and performance of this approach is demonstrated by solving the BSE numerically for the Wannier-Mott two-band model in {\bf k} space and the semiconductors MgO and InN. For the convergence with respect to the \vk-point sampling a general trend is identified, which can be used to extrapolate converged results for the binding energies of the lowest bound states.Comment: 13 pages, 12 figures, 1 table, submitted to PR